Traffic Backfilling Via Network Coding In A Multi-Packet Reception Network

ABSTRACT

Network coding and multiple packet reception (MPR) are used together to improve message dissemination speed in a wireless network using half duplex communication. In at least one embodiment, MPR is used to initially distribute data packets from a number of source nodes in the network to the other nodes of the network. Network coding techniques may then be used to perform backfilling within the network to supply data packets to the source nodes that were originally missed due to the half duplex constraint.

CROSS REFERENCE TO RELATED APPLICATION

The present application claims the benefit of U.S. Provisional Patent Application No. 61/553,386 filed on Oct. 31, 2011, which is incorporated by reference herein in its entirety.

GOVERNMENT RIGHTS

This work was supported by the United States Department of the Air Force under Contract No. FA8721-05-C-0002. The Government has certain rights in this invention.

FIELD

Subject matter described herein relates generally to wireless communication and, more particularly, to techniques for enhancing throughput and increasing data dissemination speeds in a wireless network.

BACKGROUND

In a wireless system, bandwidth is typically a limited and expensive resource. Therefore, there is a general desire to develop communication strategies that use bandwidth efficiently. In a network scenario, bandwidth efficiently and delivery speed may be improved by increasing data dissemination speeds in the network.

SUMMARY

In accordance with one aspect of the concepts, systems, circuits, and techniques described herein, a method for distributing a plurality of data packets to nodes of a half duplex wireless network from source nodes within the network comprises: selecting a group of m source nodes to transmit in each time slot, wherein m is a multi-packet reception (MPR) capability of the wireless network; transmitting original data packets from the source nodes during first time slots until all data packets in the plurality of data packets have been transmitted, wherein transmitting data packets includes transmitting the data packets for one group per time slot and in an uncoded or coded form; and transmitting one or more coded packets from one or more non-source nodes in the wireless network during at least one second time slot, the one or more coded packets each including a linear combination of original data packets transmitted during the first time slots, to achieve backfilling for the source nodes.

In accordance with another aspect of the concepts, systems, circuits, and techniques described herein, a wireless network comprises: (a) a plurality of wireless nodes, each node in the plurality of wireless nodes including at least one wireless transceiver to support half duplex wireless communication with other wireless nodes, wherein, at a particular point in time, some of the plurality of wireless nodes may be source nodes having data packets ready for distribution to the other nodes in the network and the remainder of the plurality of wireless nodes may be non-source nodes; and (b) one or more processors to: (i) select a group of in source nodes in each time slot, wherein m is a multi-packet reception (MPR) capability of the wireless network; (ii) cause data packets to be transmitted from the source nodes during first time slots until all data packets have been transmitted, wherein the data packets are transmitted one group per time slot; and (iii) cause one or more coded packets to be transmitted from one or more non-source nodes in the wireless network during at least one second time slot, the one or more coded packets each including a linear combination of data packets transmitted during the first time slots, to achieve backfilling for the source nodes.

In accordance with still another aspect of the concepts, systems, circuits, and techniques described herein, a method for use in a wireless network that supports multi-packet reception (MPR), network coding, and half duplex communication, comprises: transmitting a data packet from a first source node during a time slot within which at least one other source node transmits at least one other data packet, wherein the at least one other data packet is not received at the first source node because of the half duplex constraint; receiving at least one coded packet during one or more later time slots at the first source node; and using the at least one coded packet and previously received original data packets transmitted by at least one source node at the first source node to recover the at least one other data packet that previously went unreceived due to the half duplex constraint.

In accordance with a further aspect of the concepts, systems, circuits, and techniques described herein, a device for use in a wireless network that supports network coding and ninth packet reception (MPR) comprises: at least one wireless transceiver having MPR capability, the at least one wireless transceiver supporting half-duplex wireless communication; a network coding module to perform network coding and/or network decoding for the wireless node device; and a controller to receive, via the at least one wireless transceiver, at least one coded packet from one or more nodes in the wireless network during a data distribution operation and to use the at least one coded packet, along with original data packets transmitted by at least one non-source node previously received during the data distribution operation, to recover one or more data packets that previously went unreceived due to the half duplex nature of the at least one wireless transceiver.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 is a schematic diagram illustrating an exemplary fully-connected wireless mesh network that may incorporate features described herein;

FIG. 2 is a graph illustrating how total time for all nodes to receive each packet may vary with MPR coefficient and with the total number of source nodes in the network, with and without network coding;

FIG. 3 is a graph illustrating how total time for all nodes to receive each packet may vary with the total number of nodes, as well as the total fraction of source nodes, with and without network coding;

FIG. 4 is a graph illustrating how the total time for all nodes to receive each packet may vary with number of source nodes and the MPR capability, with and without network coding;

FIG. 5 is a graph illustrating how total time for all nodes to receive each packet may vary with number of packets per source node and the MPR capability, with and without network coding;

FIG. 6 is a flow diagram showing a process for distributing packets from J source nodes within a wireless network that supports both network coding and MPR in accordance with an embodiment; and

FIG. 7 is a block diagram illustrating an example wireless device architecture that may be used in accordance with an embodiment.

DETAILED DESCRIPTION

Techniques, devices, and systems are described herein that may be used to provide rapid distribution of packets in a wireless network using a combination of multi-packet reception (MPR) and network coding. In at least one embodiment, the techniques, devices, and systems may be implemented within a fully connected, half duplex, wireless mesh or ad-hoc network. MPR may be used to rapidly distribute the packets from a plurality of source nodes to the other nodes of the network. Network coding may then be used to provide backfilling in the network to provide packets to nodes that were transmitting when the packets were originally transmitted. The techniques, devices, and systems described herein are capable of significantly increasing packet dissemination speed within a wireless network.

A wireless mesh or ad-hoc network is a decentralized type of network that includes a number of wireless nodes that can intercommunicate through peer-to-peer wireless links. This is in contrast to an infrastructure-type wireless network where wireless nodes within a region communicate with one another, and/or with a larger network, through an associated wireless access point, base station, or other centralized control station. A wireless mesh network is a “fully connected” network if each of the nodes of the network are in communication range of each of the other nodes in the network.

FIG. 1 is a schematic diagram illustrating an exemplary fully-connected wireless mesh network 10 that may incorporate features described herein. As shown, network 10 may include a number of wireless nodes 12, 14, 16, 18, 20 that are all within communication range of one another. The wireless nodes 12, 14, 16, 18, 20 may each include at least one wireless transceiver to support communication with the other nodes 12, 14, 16, 18, 20. Because network 10 is fully connected, transmissions from one of the nodes (e.g., node 12) can be received by each of the other nodes (e.g., nodes 14, 16, 18, 20) in the network. In some implementations, communication within the network 10 may be carried out in successive time slots. Although network 10 is shown with five nodes in FIG. 1, it should be appreciated that, in general, a wireless mesh network may include any number of nodes (i.e., N≧2, where N is the number of nodes in the network). The wireless mesh network may also be part of a network that contains infrastructure.

En some implementations, the nodes of a wireless mesh network may be operating under a half duplex constraint. In general, the phrase “duplex communication” refers to two-way communication between two nodes. Half-duplex communication is communication where a node is capable of transmitting and receiving, but not at the same time. That is, the node has to stop transmitting before it can receive signals from another node.

With reference to FIG. 1, at a particular point in time, there may be a subset of nodes in network 10 that each have one or more packets that need to be distributed to all of the other nodes in the network. For example, node 12, node 14, and node 16 may each have 3 packets that need to be distributed to all of the nodes 12, 14, 16, 18, 20 of the network 10. A goal may be to successfully transfer all of these packets to all nodes in the network in a minimal or near minimal amount of time. As used herein, the phrases “source nodes” and “transmitting nodes” will be used to refer to nodes of a network that have packets ready for distribution. The letter J will be used herein to denote the number of source nodes within a network at a particular time.

Multi-packet reception (MPR) is a technique that allows a wireless node to receive packets from multiple different sources simultaneously within a single time slot). Various different wireless transmission technologies may be utilized to support the implementation of MPR in a wireless network including, for example, code division multiple access (CDMA), frequency hopping spread spectrum, direct sequence spread spectrum, multiple input/multiple output (MIMO), orthogonal frequency division multiple access (OFDMA), multiple polarizations, and/or others. In one technique, that will be referred to herein as heterogeneous MPR, MPR may be implemented using multiple radios operative within different frequency bands and/or following different wireless standards. The wireless standards may include, for example, two or more of IEEE 802.11, IEEE 802.15, IEEE 802.16, Bluetooth, Zigbee, Ultrawideband, third generation mobile communication standards, fourth generation mobile communication standards, satellite communications standards, wireless cellular standards, and/or others). Any of the above described MPR techniques may be used in embodiments described herein. MPR can improve throughput in a wireless network by, among other things, relieving channel contention and multi-user interference issues, reducing data loss due to collisions, and/or increasing the amount of data that can be transferred per unit of time. In many cases, special MPR-enabled receivers are needed for MPR to be successfully implemented within a network. The number of packets that an MPR-enabled device is capable of receiving simultaneously will be referred to herein as the MPR coefficient, m, of the device.

Network coding is a coding technique that encodes data by forming linear combinations of packets in a network. As described previously, in at least one embodiment, network coding is used to provide backfilling during packet dissemination operations in a wireless mesh network. Using network coding, coded packets may be distributed in a network and then decoded at destination nodes of the network. To decode one or more coded packets, a destination node must have a minimum number of degrees-of-freedom. For example, if a destination node receives a coded packet that is a linear combination of packets A, B, C, D, and E, and the destination node already knows packets A, B, C, and D, then the destination node may be able to extract packet E from the coded packet. In some cases, a destination node may need to have multiple coded packets to be able to extract desired information from the packets. For instance, in the example above, if the destination node receives a coded packet that is a linear combination of packets A, B, C, D, and E, and the destination node only has knowledge of packets A, B, and C, it will need an additional degree of freedom in order to extract packets D and E. This additional degree of freedom may be provided by, for example, another received coded packet.

In at least one implementation, random linear network coding (RLNC) techniques may be used may be used to provide backfilling in a wireless mesh network. RLNC is a form of network coding that uses randomly generated coefficients to form linear combinations of packets to be transmitted in a network. One example system and method for implementing RLNC is described in U.S. Pat. No. 7,706,365 to Effros et al. entitled “Randomized Distributed Network Coding,” which is hereby incorporated by reference in its entirety.

In the discussion below, techniques are first discussed for distributing packets in a fully connected, half duplex, wireless mesh network using multi-packet reception (MPR) alone. Techniques are then discussed for distributing packets in a fully connected, half duplex, wireless mesh network using a novel combination of MPR and network coding. Two time metrics will be used to gauge the performance of the system in both of the above-described cases: (1) the total time (T_(tot)) required for dissemination of the source packets to all nodes in the network, and (2) the average time (T_(avg)) for dissemination of the packets. T_(tot) will be used as a measure of the delay performance of the last node to acquire all of the packets. T_(avg) will be used as a measure of the average delay performance of the network. Two other time metrics that will be used include: (1) T₁, the number of time slots until all of the J source nodes have transmitted their packets, and (2) T₂, the number of time slots to complete the backfilling after the source nodes have transmitted their packets. Other variables that will be used in the discussion that follows include: N, the timber of nodes in the network; J, the number of source nodes (or transmitting nodes) in the network; k, the number of packets to be transmitted per source node; m, the MPR coefficient; and T(i) is the first time slot in which node i has received every packet. In some implementations, two conditions may be imposed regarding the size of the network. The first condition is that the number of non-source nodes in the network will not fall below the MPR coefficient (i.e., N−J≧m). The second condition is that the number of nodes in the network will be at least twice the MPR capability of the system (i.e., N≧2m).

In a wireless network, each node will have an MPR capability. The MPR capability of a node indicates the number of packets the node can simultaneously receive. In some networks, all nodes may have the same MPR capability. In others, different nodes may have different MPR capabilities. The MPR capability of a wireless network will depend on the capabilities of the nodes of the network. In at least one embodiment, the MPR capability m of a wireless network will be taken as the lowest MPR capability of the individual nodes of the network. Other techniques for defining the MPR capability of a network may alternatively be used. As used herein, the term MPR coefficient may be used interchangeably with MPR capability.

Packet distribution techniques that use MPR without network coding will now be described. To simplify the discussion, it will first be assumed that each source node in a fully connected wireless mesh network has only a single packet to be distributed (i.e., k=1 for each source node) to all of the other nodes. Since receivers are limited to m receptions per time slot, the group of transmitting nodes in any given time slot will have m or fewer nodes. In some embodiments, the groups of source nodes chosen to transmit in different time slots may overlap. In other embodiments all nodes are partitioned into disjoint groups of m nodes which transmit in different groups of time slots. In this manner, all nodes within each group can transmit simultaneously within a time slot. If the number of source nodes J is not a multiple of m, the last group of source nodes to transmit will have fewer than in nodes (i.e., J mod m nodes). The number of time slots T₁ that it will take for all J sauce nodes to transmit their packets will then be:

$T_{1} = \left\lceil \frac{J}{m} \right\rceil$

which represents one time slot for each group. Because of the half-duplex constraint, the source nodes will need to be backfilled to provide the packets that could not be received during transmission. Because in this embodiment transmissions occur in distinct groups of m nodes, each source node can miss a maximum of m−1 packets during its transmission slot. If the condition N−J≧m applies, the source nodes can be hack-filled using m of the non-source nodes. Each group can be back-filled in one time slot and backfilling will take the same number of slots as T₁. The number of time slots to complete the back-filling may be expressed as follows;

$T_{2} = {\left\lceil \frac{J}{m} \right\rceil {u\left( {J - 1} \right)}}$

where u(J) is the unit step function defined as:

${u(J)} = {\begin{Bmatrix} 0 & {:{J \leq 0}} \\ 1 & {:{J > 0}} \end{Bmatrix}.}$

Table 1 below shows a sample transmission schedule for a scenario where N=8, J=5, k=1, and m=2. The nodes of the network are identified in Table 1 as nodes A, B, C, D, E, F, G, and H. The source nodes are nodes A, B, C, D, and E. As shown, during first time slot t₁, nodes A and B each transmit their respective packets X_(A) and X_(B). These packets are received by all other nodes in the network. However, because nodes A and B are transmitting and the half duplex constraint applies, node A doesn't receive packet X_(B) and node B doesn't receive packet X_(A). During second time slot t₂, nodes C and D transmit their respective packets X_(C) and X_(D). These packets are received by all other nodes in the network, except node C doesn't receive packet X_(D) and node D doesn't receive packet X_(C). During third time slot t₃, node E transmits its packet X_(E). This packet is received by all other nodes in the network. Because only one packet transmits during t₃, all nodes in the network will have packet X_(E) at the end of t₃ (i.e., no packets are lost due to the half duplex constraint). This terminates the initial transmission of packets and T₁=3.

Backfilling is now performed to fill-in the packets that were missed during the initial transmissions due to the half duplex constraint. To perform the backfilling, non-source nodes may be employed. During fourth time slot t₄, nodes F and G transmit packets X_(A) and X_(B), respectively. Node A thus receives packet X_(B) and node B receives packet X_(A). Node A and B now have all transmitted packets. During fourth time slot t₅, nodes F and G transmit packets X_(C) and X_(D), respectively. Node C thus receives packet X_(D) and node D receives packet X_(C). Node C and D now have all transmitted packets. This ends the packet distribution operation and T₂=2.

TABLE 1 Node (i) t₁ t₂ t₃ t₄ t₅ T(i) A X_(A) → X_(C), X_(D) X_(E) X_(B) 4 B X_(B) → X_(C), X_(D) X_(E) X_(A) 4 C X_(A), X_(B) X_(C) → X_(E) X_(D) 5 D X_(A), X_(B) X_(D) → X_(E) X_(C) 5 E X_(A), X_(B) X_(C), X_(D) X_(E) → 2 F X_(A), X_(B) X_(C), X_(D) X_(E) X_(A) → X_(C) → 3 G X_(A), X_(B) X_(C), X_(D) X_(E) X_(B) → X_(D) → 3 H X_(A), X_(B) X_(C), X_(D) X_(E) 3

The case will now be described where each source node in the network has multiple packets to be distributed (i.e., k>1 for each source node). Two separate cases will be discussed: namely, J≦m and J>m. When the number of source nodes is less than or equal to the MPR coefficient (J≦m), the MPR capability of the system cannot be fully utilized and the initial transmissions will occur in groups of J nodes per time slot. Therefore, T₁=k. As discussed previously, if the condition N−J≧m applies, the J source nodes can be backfilled by m of the non-source nodes. Thus:

$T_{2} = {\left\lceil \frac{Jk}{m} \right\rceil {u\left( {J - 1} \right)}}$

and the total completion time is:

$T_{tot} = {k + {\left\lceil \frac{Jk}{m} \right\rceil {u\left( {J - 1} \right)}}}$

The average completion time can be upper bounded by noting that the N−J non-source nodes will have all the data by T₁ and the J source nodes will have every packet in at most T₁+T₂ time slots. Thus:

$T_{avg} \leq {k + {\frac{J}{N}\left\lceil \frac{Jk}{m} \right\rceil {{u\left( {J - 1} \right)}.}}}$

When the number of source nodes is greater than the MPR coefficient (J>m), m new packets can be transmitted in each time slot. This may be achieved by using all possible combinations of m source nodes. In other words, there are

$\quad\begin{pmatrix} J \\ m \end{pmatrix}$

distinct groups of m out of J nodes (where

$\quad\begin{pmatrix} x \\ y \end{pmatrix}$

is the combination function). Any given node is present in

$\quad\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}$

groups and is excluded from

$\quad\begin{pmatrix} {J - 1} \\ m \end{pmatrix}$

groups. If k is an integral multiple of

$\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix},$

then each node can transmit

$k/\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}$

packets during each transmission round, and T₁ can be represented as:

$T_{1} = {{\begin{pmatrix} J \\ m \end{pmatrix}\frac{k}{\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}}} = \frac{Jk}{m}}$

Because of the half-duplex constraint, the J source nodes need to be backfilled. Since the transmitting groups during time T₁ are distinct and known to other nodes, the groups can be back-filled consecutively. The backfilling time T2 may then be expressed as:

$T_{2} = \frac{Jk}{m}$

and the total completion time is:

$T_{tot} = {2{\left( \frac{Jk}{m} \right).}}$

The average completion time may the be upper bounded as follows:

$T_{avg} \leq \frac{{\left( {N - J} \right)T_{1}} + {J\left( {T_{1} + T_{2}} \right)}}{N} \leq {\frac{Jk}{m}\left( {1 + \frac{J}{N}} \right)}$

Packet distribution techniques that use MPR with network coding will now be described. As discussed previously, backfilling is a technique that is used to provide data packets to nodes that were not previously received due to the half duplex constraint (i.e., because the node was transmitting when the data was originally transmitted). In at least one embodiment, network coding techniques are used to provide backfilling, in an MPR enabled network to improve overall throughput. Table 2 below shows a sample transmission schedule for an MPR/network coding implementation where N=8, J=5, k=1, and m=2. As in Table 1 above, the nodes of the network are identified in Table 2 as nodes A, B, C, D, E, F, G, and H. The source nodes are nodes A, B, C, D, and E. As shown, transmissions during the first three time slots t₁, t₂, t₃ remain the same as in Table 1 (and T₁ remains unchanged). However, during time slot t₄, network coding is used to perform the back filling. As shown, a coded packet that includes a linear combination of all of the originally transmitted packets (X_(A), X_(B), X_(C), X_(D), and X_(E)) is transmitted during time slot t₄. The linear combination may take the form a₁X_(A)+a₂X_(B)+a₃X_(C)+a₄X_(D)+a₅X_(E), where a₁, a₂, a₃, a₄, and a₅ are coding coefficients and may be selected according to the size of the required finite field. In some embodiments, the coded packet that is transmitted may have the coefficients appended thereto, in addition to the linear combination, for use in decoding the linear combination. Because nodes A, B, C, and D each have all packets but one, they can each extract the one missing packet from the coded packet. Thus, the entire backfilling operation is performed within a single time slot in the example of Table 2 (i.e., T₂=1).

TABLE 2 Node (i) t₁ t₂ t₃ t₄ t₅ T(i) A X_(A) → X_(C), X_(D) X_(E) X_(B) 4 B X_(B) → X_(C), X_(D) X_(E) X_(A) 4 C X_(A), X_(B) X_(C) → X_(E) X_(D) 4 D X_(A), X_(B) X_(D) → X_(E) X_(C) 4 E X_(A), X_(B) X_(C), X_(D) X_(E) → 4 F X_(A), X_(B) X_(C), X_(D) X_(E) a₁X_(A) + a₂X_(B) + a₃X_(C) + a₄X_(D) + a₅X_(E) → 2 G X_(A), X_(B) X_(C), X_(D) X_(E) 3 H X_(A), X_(B) X_(C), X_(D) X_(E) 3

In the example described above, each source node in the network has a single packet to transmit (i.e., k=1). The case will now be described where each source node in the network has multiple packets to be distributed (i.e., k>1 for each source node). As before, the problem will be analyzed separately for the two cases: J≦m and J>m. First, the situation where the number of source nodes is less than or equal to the MPR coefficient (J≦m) will be addressed. Since network coding is only used to perform backfilling, T₁ will be the same as the case of MPR with no network coding (i.e., T₁=k). As discussed previously, if the condition N−J≧m applies, there will be at least m nodes that did not participate in any of the previous transmissions and have received all of the JK transmitted packets. The backfilling may be accomplished by having each of these m nodes transmit a linear combination of all packets that it has received thus far. Every time these m nodes transmit, m independent coded packets are sent out and, as a result, the original J source nodes will get m new degrees of freedom in each time slot. Using this approach, backfilling will be completed in T₂=┌(j−1)k/m┌ time slots. The total completion may then be expressed as:

$T_{tot} = {{T_{1} + T_{2}} = {k + {\left\lceil \frac{\left( {J - 1} \right)k}{m} \right\rceil.}}}$

Based on the fact that all non-transmitting nodes will have every packet by T₁ and the J source nodes will have the data after T₁+T₂ time slots, the average completion time may be calculated as:

$T_{avg} = {\frac{{\left( {N - J} \right)T_{1}} + {J\left( {T_{1} + T_{2}} \right)}}{N} = {k + {\frac{J}{N}{\left\lceil \frac{\left( {J - 1} \right)k}{m} \right\rceil.}}}}$

The situation where the number of source nodes is greater than the MPR coefficient (J≦m) will now be discussed. As before, it will be assumed that k is an integer multiple of

$\quad\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}$

and the source nodes will transmit

$k/\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}$

original packets during the first

$\quad\begin{pmatrix} J \\ m \end{pmatrix}$

time slots. Thus, T₁ will again be:

$T_{1} = {{\begin{pmatrix} J \\ m \end{pmatrix}\frac{k}{\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}}} = \frac{Jk}{m}}$

During each transmission, m nodes will transmit simultaneously and any given node within a transmitting group will be unable to receive the packets from the other m−1 nodes. Since each node transmits k packets, each node will be missing (m−1)k packets after T₁. Therefore, each source node will require (m−1)k coded packets (or degrees of freedom) to retrieve the missing packets. The backfilling will then be completed in T₂=(m−1)k/m time slots. The total transmission time will then be:

$T_{tot} = {{T_{1} + T_{2}} = {\frac{k}{m}\left( {J + m - 1} \right)}}$

and the average completion time is:

$T_{avg} = {\frac{{\left( {N - J} \right)T_{1}} + {J\left( {T_{1} + T_{2}} \right)}}{N} = {\frac{Jk}{m}{\left( {1 + \frac{m - 1}{N}} \right).}}}$

This strategy thus demonstrates how network coding can be used with MPR to reduce the total and average transmission times.

A comparison will now be made of the total and average transmission times (1) without MPR and network coding, (2) using MPR without network coding, and (3) using MPR with network coding. In practical networks, the number of source nodes is usually much greater than the MPR capability of the system. Therefore, the comparison will compare the results for the case where J>m. Without MPR, the total transmission time is:

T_(tot)=jk,

and the average transmission time is:

$T_{avg} = {{Jk} - {\frac{k}{N}.}}$

When MPR is used without network coding, the total transmission time is:

${T_{tot} = {2\left( \frac{Jk}{m} \right)}},$

and the average completion time is upper bounded as follows:

$T_{avg} \leq {\frac{Jk}{m}{\left( {1 + \frac{J}{N}} \right).}}$

When MPR is used with network coding, the total transmission time is:

$T_{tot} = {\frac{k}{m}\left( {J + m - 1} \right)}$

and the average completion time is:

$T_{avg} = {\frac{Jk}{m}{\left( {1 + \frac{m - 1}{N}} \right).}}$

Comparing the above results, it is apparent that MPR can reduce T_(tot) by a factor of m/2. However, when m=2, the total transmission time remains unchanged. By adding network coding, the total transmission time may be further reduced by a factor of 2J/(J+m−1). As J increases, this factor becomes arbitrarily close to 2.

FIG. 2 is a graph illustrating how T_(tot) varies with MPR coefficient, with and without network coding, for various numbers of source nodes and k=1. In the figure, solid lines are used to denote the use of network coding and dashed lines are used to denote no network coding. As is evident from FIG. 2, the addition of network coding can reduce the total transmission time significantly. For example, plot 30 corresponds to a scenario where the number of source nodes is 50 and network coding is being used and plot 30 corresponds to a scenario where the number of source nodes is 50 and network coding is not being used. As shown, when m=3, the total transmission time is almost double when network coding is not being used. Plot 34 is FIG. 2 corresponds to a scenario where the number of source nodes is 25 and network coding is not being used. As shown using an ellipse in the figure, plot 34 (J=25, no network coding) closely follows plot 30 (J=50, with network coding) for m≧2, despite the fact that plot 30 involves twice as many source nodes. Thus, coding yields the same total transmission time as a network with no coding and only half the traffic. It should be noted from FIG. 2 that, when network coding is not being used, the total transmission time does not change when the MPR coefficient is increased from 1 to 2. In contrast, a significant reduction is achieved in total transmission time when the MPR coefficient is increased from 1 to 2 and network coding is being used.

As described above, FIG. 2 assumes that each source node has a single packet to transmit (i.e., k=1). In situations where k>1, if k is an integral multiple of

$\quad\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}$

as described previously, the value of T_(tot) would be the value shown in FIG. 2 multiplied by k.

FIG. 3 is a graph illustrating how T_(tot) varies with number of nodes N, with and without network coding, for various numbers of source nodes, k=1, and fixed m (i.e., m=4). As in FIG. 2, solid lines denote the use of network coding and dashed lines denote no network coding. As shown, when m is fixed, T_(tot) grows linearly with the number of nodes if the ratio J/N is kept constant. As shown in the FIG. 3, the total transmission time of a network with j=┌N/2┐ source nodes that uses network coding is only slightly higher than that of a network with j=┌N/4┐ source nodes that does not use network coding.

FIG. 4 is a graph illustrating how T_(tot) varies with number of source nodes J, with and without network coding, for various MPR coefficients. As shown, for a given value of m, the total transmission time T_(tot) increases linearly with the number of source nodes J. It should be noted that the there is some crossover in the plots in the region between J=1 and J=4. This is because J<m in this range and the behavior is governed by different equations. If the traffic comes from a fixed number of source nodes J, then the total transmission time T_(tot) will not be affected by an increase in the total number of nodes N.

FIG. 5 is a graph illustrating how T_(tot) varies with number of packets per source node k, with and without network coding, for various MPR coefficients, N=9, and J=5. As shown, for the most part, T_(tot) increases linearly with the number of packets k. Thus, the amount of time saved by adding network coding when there is a fixed MPR capability is seen to increase with the number of packets k. The small discontinuities seen on each plot are caused by the integrality constraint on k (i.e., k being an integral multiple of

$\left. \begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix} \right).$

It should be appreciated that, in some implementations, k is not constrained to being an integer multiple of

$\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}.$

FIG. 6 is a flow diagram showing a process for distributing packets from J source nodes within a wireless network uses both network coding and MPR.

The rectangular elements (typified by element 52 in FIG. 6) are herein denoted “processing blocks” and may represent computer software instructions or groups of instructions. It should be noted that the flow diagram of FIG. 6 represents one exemplary embodiment of the design described herein and variations in such a diagram, which generally follow the process outlined, are considered to be within the scope of the concepts, systems, and techniques described and claimed herein.

Alternatively, the processing blocks may represent operations performed by functionally equivalent circuits such as a digital signal processor circuit, an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), and/or discrete circuits (analog or digital). Some processing blocks may be manually performed while other processing blocks may be performed by a processor, circuit, or other machine. The flow diagram does not depict the syntax of any particular programming language. Rather, the flow diagram illustrates the functional information one of ordinary skill in the art requires to fabricate circuits and/or to generate computer software to perform the processing required of the particular apparatus. It should be noted that many routine program elements, such as initialization of loops and variables and the use of temporary variables, are not shown. It will be appreciated by those of ordinary skill in the art that unless otherwise indicated herein, the particular sequence described is illustrative only and can be varied without departing from the spirit of the concepts described and/or claimed herein. Thus, unless otherwise stated, the processes described below are unordered meaning that, when possible, the sequences shown in FIG. 6 can be performed in any convenient or desirable order.

Turning now to FIG. 6, a method 50 for distributing data packets within a wireless network having J source nodes is now described. The method 50 may be performed within the fully connected wireless mesh network 10 of FIG. 1 and/or in other wireless networks. The method 50 of FIG. 6 may be coordinated from a central location within a wireless network (e.g., a selected node, etc.) or it may be coordinated in a more distributed manner throughout a network. In at least one embodiment, the method of FIG. 6 may be implemented in the medium access control (MAC) layer of a network within, for example, a MAC controller. As described above, the wireless network will support the use of both MPR and network coding. The network will have an MPR capability of m, which may be representative of the lowest MPR capability of the various nodes in the network. In some implementations, each source node will have k packets to be distributed. In other implementations, each source node may have a different number of packets to be transmitted.

With reference to FIG. 6, in one embodiment the source nodes may first be divided into node groups that each have in nodes (block 52). Original data packets may then be transmitted from source nodes during first time slots at one group per time slot until all data packets have been transmitted (block 54). One or more coded packets may then be transmitted from one or more non-source nodes in the network during at least one second time slot, the one or more coded packets each including a linear combination of uncoded packets transmitted during the first time slots, to achieve backfilling for the source nodes (block 56). In at least one implementation, the coded packets will each include a linear combination of all uncoded packets transmitted during the first time slots. The coded packets may also include information regarding the coefficients used to generate the linear combinations for use in decoding in some implementations.

The source nodes may be divided into node groups in a variety of different ways. For example, in one approach, source nodes may be randomly grouped together. In another approach, source nodes may be grouped based on physical position. In still another approach, nodes may be grouped based on priority (e.g., quality of service (QoS) or some other indicator of preference for nodes, users, or messages). The higher priority groups may then be scheduled to transmit before the lower priority groups. In at least one embodiment, as described above, the source nodes may be divided into

$\quad\begin{pmatrix} J \\ m \end{pmatrix}$

distinct groups. Transmissions may then be performed by cycling through the

$\quad\begin{pmatrix} J \\ m \end{pmatrix}$

distinct groups until all of the packets have been transmitted. If k is an integral multiple of

$\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix},$

then each source node can transmit

$k/\begin{pmatrix} {J - 1} \\ {m - 1} \end{pmatrix}$

packets during each transmission cycle.

In embodiments where the source node can each include a different number of data packets for transmission, the number of data packets associated with each source node may be taken into consideration in defining the node groups. For example, in one possible approach, nodes groups having a similar number of packets for transmission may be grouped together. In another approach, a particular source node may be made a part of multiple groups so as to obtain maximum utilization of the MPR capability of the network. For example, if a first source node includes 5 packets for transmission, a second source node includes 4 packets for transmission, a third source node includes 3 packets for transmission, and m=2, a first group may be selected to include the first source node and the second source node. This group may transmit during four consecutive time slots. A second group may be defined that includes the first source node and the third source node. This group may transmit during the filth consecutive time slot so that the fifth packet of the first source node is transmitted. This process may then be continued for all other source nodes until all packets have been transmitted. Other techniques for dividing up the source nodes, including combinations of the above techniques, may be used in other embodiments.

As described above, in block 54, unaided or coded packets may be transmitted from source nodes during first time slots at one group per time slot. However, the groups do not have to transmit in any particular order. For example, in some embodiments, the transmissions may be performed in cycles through the various groups. In other embodiments, a random order through the groups may be used. In priority-based groups are used, the groups may be transmitted in priority order. As will be appreciated, many different alternatives may be used in different implementations.

In at least one embodiment, the coded packet(s) that are transmitted during the backfilling operations are generated using random linear network coding (RLNC) techniques. Using RLNC, data packets to be transmitted are linearly combined using randomly generated coefficients. In some implementations, the randomly generated coefficients may be appended to the transmit signal for use in decoding by a destination node. In some other implementations, a sender and a receiver may have synchronized or, more generally, coordinated random number generators to generate the coefficients so that the coefficients do not need to be appended to the transmit signal. Each coded packet that is transmitted may have different randomly generated coefficients.

The total number of coded packets that are transmitted during the second time slot(s) should be enough to supply the highest number of missing packets required by a source node (i.e., the highest number of degrees of freedom needed). In some implementations, each source node may have the same number of missing packets when backfilling is initiated. In other implementations, different source nodes may have different numbers of missing packets when backfilling is initiated, and it may vary according to the MPR capability of each source node.

FIG. 7 is a block diagram illustrating an example wireless device architecture 100 that may be used for a node in a wireless mesh network in accordance with an embodiment. As illustrated, the wireless device architecture 100 may include: one or more digital processors 102, a memory 104, one or more wireless transceivers 106, and a network coding module 108. A bus 110 and/or one or more other transmission structures may be provided for establishing interconnections between various components of the architecture 100. The wireless transceiver(s) 106 may be coupled to one or more antennas 112 and/or other transducers to facilitate the transmission and/or reception of wireless signals.

Digital processor(s) 102 may include one or more digital processing devices that are capable of executing programs to provide one or more functions and/or services to a user. Digital processor(s) 102 may be used to, for example, execute an operating system of a corresponding wireless device. Digital processor(s) 102 may also be used to, for example, execute user application programs. In addition, digital processor(s) 102 may be used to implement, either partially or fully, one or more of the processes or techniques described herein. Digital processor(s) 102 may include any type of digital processing device including, for example, a general purpose microprocessor, as digital signal processor (DSP), a controller, a microcontroller, an application specific integrated circuits (ASIC), as field programmable gate array (FPGA), a programmable logic array (PLA), a programmable logic device (PLD), as reduced instruction set computer (RISC), and/or others, including combinations of the above.

Wireless transceiver(s) 206 may include any type of transceiver that is capable of supporting wireless communication with one or more remote wireless entities. In various implementations, wireless transceiver 206 may be configured in accordance with one or more wireless networking standards and/or wireless cellular standards. In some implementations, multiple wireless transceivers may be provided to support operation with different networks or systems in a surrounding environment. In addition, in some implementations, multiple wireless transceivers may be provided to support the use of heterogeneous MPR. As illustrated in FIG. 7, in some implementations, wireless transceiver 106 may include a medium access control (MAC) module 114 to facilitate medium access operations on an associated wireless network medium or channel. In some embodiments, some (or all) of the MAC functionality may be provided in digital processor(s) 102. In addition, in some implementations, wireless transceiver(s) 106 may include a multi-packet reception (MPR) module 116 to facilitate the use of MPR by a corresponding wireless device. In at least one embodiment, MPR module 116 is capable of supporting heterogeneous MPR using two different receivers in wireless transceiver(s) 106.

Memory 104 may include any type of structure that is capable of storing digital information. The digital information may include, for example, digital user data, computer executable instructions and/or programs, or any other type of data. In some implementations, memory 104 may be used to, for example, store data packets and/or coded packets that are ready for transmission into a wireless network. Memory 104 may include, for example, magnetic data storage devices, disc based storage devices, optical storage devices, semiconductor memories, read only memories (ROMs), random access memories (RAMs), non-volatile memories, flash memories, USB drives, compact disc read only memories (CD-ROMs), DVDs, Blu-Ray disks, magneto-optical disks, erasable programmable ROMs (EPROMs), electrically erasable programmable ROMs (EEPROMs), magnetic or optical cards, and/or others.

Network coding module 108 is operative for performing network coding operations and/or network decoding operations for the mobile device. In some implementations, network coding module 108 may be called upon to, for example, generate coded packets by linearly combining other data packets. In some implementations, network coding module 108 may combine packets using an exclusive-OR function, such as used in COPE. However, in other implementations, other or additional forms of network coding may be implemented within network coding module 108 such as, for example, random linear network coding (RLNC). Although illustrated as a separate unit in FIG. 7, it should be appreciated that, in some implementations, network coding module 108 may be implemented within digital processor(s) 102.

It should be appreciated that the mobile device architecture 100 of FIG. 7 represents one possible example of an architecture that may be used in a implementation. Other architectures may alternatively be used. It should also be appreciated that all or part of the various devices, processes, or methods described herein may be implemented using any combination of hardware, firmware, and/or software.

Features described herein can be implemented in a variety of different forms. For example, features may be embodied within laptop, palmtop, desktop, and tablet computers with or without wireless capability; smart phones; cellular telephones; personal digital assistants (PDAs); satellite communicators; satellite-based transceivers; pagers; airborne transceivers residing on, for example, aircraft, helicopters, etc.; maritime transceivers; network interface cards (NICs) and other network interface structures; base stations; wireless access points; television sets; set to boxes; audio/video devices; sensors; cameras and other imaging devices; appliances having wireless capability; integrated circuits; as instructions and/or data structures stored on non-transitory computer readable media; and/or in other formats. Examples of different types of computer readable media that may be used include floppy diskettes, hard disks, optical disks, compact disc read only memories (CD-ROMs), digital video disks (DVDs), Blu-ray disks, magneto-optical disks, read only memories (ROMs), random access memories (RAMs), erasable programmable ROMs (EPROMs), electrically erasable programmable ROMs (EEPROMs), magnetic or optical cards, flash memory, and/or other types of media suitable for storing electronic instructions or data.

Having described preferred embodiments which serve to illustrate various concepts, structures, and techniques which are the subject of this patent, it will now become apparent to those of ordinary skill in the art that other embodiments incorporating these concepts, structures, and techniques may be used. Accordingly, it is submitted that that scope of the patent should not be limited to the described embodiments, but rather should be limited only by the spirit and scope of the following claims. 

What is claimed is:
 1. A method for distributing a plurality of data packets to nodes in a half duplex wireless network from source nodes within the network, the method comprising: selecting a group of m or fewer nodes in each time slot, wherein m is a multi-packet reception (MPR) capability of the wireless network, to act as source nodes during that time slot; transmitting original data packets from the source nodes during first time slots until all data packets in the plurality of data packets have been transmitted, wherein transmitting original data packets includes transmitting the data packets for one group per time slot and in an uncoded or coded form; and transmitting one or more coded packets from one or more non-source nodes in the wireless network during at least one second time slot, the one or more coded packets each including a linear combination of original data packets transmitted during the first time slots, to achieve backfilling for the source nodes.
 2. The method of claim 1, wherein: the one or more coded packets transmitted from non-source nodes each include a linear combination of all original data packets transmitted during the first time slots.
 3. The method of claim 2, wherein: the one or more coded packets transmitted from non-source nodes each include a linear combination of all data packets transmitted during the first time slots, weighted with a plurality of randomly generated coefficients.
 4. The method of claim 1, wherein: selecting a group of nodes at each time slot includes dividing the source nodes into groups of m nodes, which in turn includes dividing the source nodes into $\quad\begin{pmatrix} J \\ m \end{pmatrix}$ distinct groups, where $\quad\begin{pmatrix} x \\ y \end{pmatrix}$ is the combination function.
 5. The method of claim 4, wherein: transmitting data packets from the source nodes during first time slots includes transmitting data packets by cycling through the $\quad\begin{pmatrix} J \\ m \end{pmatrix}$ distinct groups until all data packets in the plurality of data packets have been transmitted.
 6. The method of claim 1, wherein: selecting a group of source nodes includes dividing the source nodes into groups based, at least in part, on priority.
 7. The method of claim 1, wherein: selecting a group of source nodes includes dividing the source nodes into groups based, at least in part, on a number of data packets to be transmitted from each source node.
 8. The method of claim 1, wherein: each source node within the wireless network includes an equal number of data packets to be transmitted.
 9. The method of claim 1, wherein: transmitting one or more coded packets from one or more non-source nodes in the wireless network during at least one second time slot includes transmitting one coded packet from each of multiple non-source nodes during a single time slot.
 10. The method of claim 1, wherein: transmitting one or more coded packets from one or more non-source nodes in the wireless network during at least one second time slot includes transmitting one coded packet from each of m or fewer non-source nodes during a single time slot.
 11. The method of claim 1, wherein: transmitting one or more coded packets from one or more non-source nodes in the wireless network during at least one second time slot includes transmitting a total number of coded packets that is at least as large as the maximum number of missing data packets required by a source node.
 12. The method of claim 1, wherein: the wireless network is a wireless mesh network.
 13. A wireless network comprising: a plurality of wireless nodes, each node in the plurality of wireless nodes including at least one wireless transceiver to support half duplex wireless communication with other wireless nodes, wherein, at a particular point in time, some of the plurality of wireless nodes may be source nodes having data packets ready for distribution to the other nodes in the network and the remainder of the plurality of wireless nodes may be non-source nodes; and one or more processors to: select a group of m or fewer source nodes at each time slot, wherein m is a multi-packet reception (MPR) capability of the wireless network; cause data packets to be transmitted from the source nodes during first time slots until all data packets have been transmitted, wherein the data packets are transmitted one group per time slot; and cause one or more coded packets to be transmitted from one or more non-source nodes in the wireless network during at least one second time slot, the one or more coded packets each including a linear combination of data packets transmitted during the first time slots, to achieve backfilling for the source nodes.
 14. The wireless network of claim 13, wherein: the one or more coded packets each include a linear combination of all data packets transmitted during the first time slots.
 15. The wireless network of claim 13, wherein: the one or more coded packets each include a linear combination of all data packets transmitted during the first time slots weighted with a plurality of randomly generated coefficients.
 16. The wireless network of claim 13, wherein: the one or more processors are configured to divide the source nodes into $\quad\begin{pmatrix} J \\ m \end{pmatrix}$ distinct groups, where $\quad\begin{pmatrix} x \\ y \end{pmatrix}$ is the combination function.
 17. The wireless network of claim 16, wherein: the one or more processors are configured to cause data packets to be transmitted from the source nodes during the first time slots by cycling through the $\quad\begin{pmatrix} J \\ m \end{pmatrix}$ distinct groups until all data packets in the plurality of data packets have been transmitted.
 18. The wireless network of claim 13, wherein: the one or more processors are configured to select each group of source nodes based, at least in part, on priority.
 19. The wireless network of claim 13, wherein: the one or more processors are configured to select each group of source nodes based, at least in part, on a number of data packets to be transmitted from each source node.
 20. The wireless network of claim 13, wherein: the one or more processors are configured to cause one coded packet to be transmitted from each of multiple non-source nodes during a second time slot.
 21. The wireless network of claim 13, wherein: the one or more processors are configured to cause one coded packet to be transmitted from each of m or fewer non-source nodes during a second time slot.
 22. The wireless network of claim 13, wherein: the one or more processors are configured to cause a total number of coded packets to be transmitted from non-source nodes that is at least as large as the highest number of missing data packets required by a source node.
 23. The wireless network of claim 13, wherein: the wireless network is a wireless mesh network.
 24. The wireless network of claim 13, wherein: the one or more processors are located at a single network location.
 25. The wireless network of claim 13, wherein: the one or more processors include multiple processors distributed across multiple network locations.
 26. A method for use in a wireless network that supports multi-packet reception (MPR), network coding, and half duplex communication, the method comprising: transmitting a data packet from a first source node during a time slot within which at least one other source node transmits at least one other data packet, wherein the at least one other data packet is not received at the first source node because of the half duplex constraint; receiving at least one coded packet transmitted by at least one non-source node, which is a linear combination of packets previously transmitted by source nodes, during one or more later time slots at the first source node; and using the at least one coded packet and previously received original data packets at the first source node to recover the at least one other data packet that previously went unreceived due to the half duplex constraint.
 27. The method of claim 26, wherein: the at least one coded packet includes a first coded packet comprising a linear combination of original packets previously transmitted by source nodes during a common data distribution operation.
 28. The method of claim 26, wherein: receiving at least one coded packet includes receiving m coded packets during a time slot, where m is the MPR capability of the wireless network.
 29. A device for use in a wireless network that supports network coding and multi-packet reception (MPR), the device comprising: at least one wireless transceiver having MPR capability, the at least one wireless transceiver supporting half-duplex wireless communication; a network coding module to perform network coding and/or network decoding for the wireless node device; and a controller to receive, via the at least one wireless transceiver, at least one coded packet from one or more nodes in the wireless network during a data distribution operation and to use the at least one coded packet, along with original data packets that were transmitted by at least one source node and previously received during the data distribution operation, to recover one or more data packets that previously went unreceived due to the half duplex nature of the at least one wireless transceiver.
 30. The device of claim 29, wherein: the at least one wireless transceiver includes an MPR module that is configured to support heterogeneous MPR, the at least one wireless transceiver having at least two wireless receivers following different wireless standards.
 31. The device of claim 29, wherein: the at least one coded packet includes a linear combination of all original data packets transmitted by source nodes during the data distribution operation.
 32. The method of claim 1, wherein the groups of nodes selected as source nodes in each time slot may be overlapping, whereby any given node may appear in more than one distinct group. 